منابع مشابه
OPTIMAL CONSTRAINED DESIGN OF STEEL STRUCTURES BY DIFFERENTIAL EVOLUTIONARY ALGORITHMS
Structural optimization, when approached by conventional (gradient based) minimization algorithms presents several difficulties, mainly related to computational aspects for the huge number of nonlinear analyses required, that regard both Objective Functions (OFs) and Constraints. Moreover, from the early '80s to today's, Evolutionary Algorithms have been successfully developed and applied as a ...
متن کاملOptimal Exact Path-Following for Constrained Differentially Flat Systems
We propose an optimization approach to calculate optimal feedforward controls for exact path-following problems of differentially flat systems. Besides the derivation of a small dimensional optimal control problem, we give easily checkable conditions on the existence of inputs guaranteeing that a given path is exactly followable in the presence of constraints on states and inputs. Our approach ...
متن کاملThe Exact Solution of Min-Time Optimal Control Problem in Constrained LTI Systems: A State Transition Matrix Approach
In this paper, the min-time optimal control problem is mainly investigated in the linear time invariant (LTI) continuous-time control system with a constrained input. A high order dynamical LTI system is firstly considered for this purpose. Then the Pontryagin principle and some necessary optimality conditions have been simultaneously used to solve the optimal control problem. These optimality ...
متن کاملOptimal Solution in a Constrained Distribution System
We develop a method to obtain an optimal solution for a constrained distribution system with several items and multi-retailers. The objective is to determine the procurement frequency as well as the joint shipment interval for each retailer in order to minimize the total costs. The proposed method is applicable to both nested and non-nested policies and ends up with an optimal solution. To solv...
متن کاملAn exact algorithm for wirelength optimal placements in VLSI design
We present a new algorithm designed to solve floorplanning problems optimally. More precisely, the algorithm finds solutions to rectangle packing problems which globally minimize wirelength and avoid given sets of blocked regions. We present the first optimal floorplans for 3 of the 5 intensely studied MCNC block packing instances and a significantly larger industrial instance with 27 rectangle...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Communications for Statistical Applications and Methods
سال: 2009
ISSN: 2287-7843
DOI: 10.5351/ckss.2009.16.2.299